New Permutation Generation Under Exchange Strategy (PGuES)
نویسندگان
چکیده
منابع مشابه
Permutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations–shift cursor algorithm and level algorithm–and their efficient implementations are presented in this paper. One implementation of shift cursor algorithm gives an optimal solution of permutation generation problem, and one implementation of level algorithm can be used to generate random permutations.
متن کاملIntegrated Strategy for Generating Permutation
An integrated strategy for generating permutation is presented in this paper. This strategy involves exchanging two consecutive elements to generate the starter sets and then applying circular and reversing operations to list all permutations. Some theoretical works are also presented. Mathematics Subject Classification: 05A05
متن کاملPermutation Admissibility in Shu e - Exchange
The set of input-output permutations that are routable through a multistage interconnection network without any connict (known as the admissible set), plays an important role in determining the capability of the network. Recent works on the permutation admissibity problem of shuue-exchange networks (SEN) of size N N, deal with (n + k) stages, where n = log2N, and k denotes the number of extra s...
متن کاملOn The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n + O(n), where n is the length of the permutation. (This improves on a (9/8)n routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8) n 2 + O(n). We also show th...
متن کاملPermutation codes invariant under isometries
The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2013
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v7n8p15